Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme
نویسنده
چکیده
We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [BLS]. Due to the instrumental structure of GDH groups and of the base scheme, it turns out that most of our constructions are simpler, more efficient and have more useful properties than similar existing constructions. We support all the proposed schemes with proofs under the appropriate computational assumptions, using the corresponding notions of security.
منابع مشابه
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational DiffieHellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [8]. Due to the instrumental structure o...
متن کاملA New Multisignature Scheme based on Strong Diffie-Hellman Assumption
Digital multisignatures improve security of digital signatures and reduce fraud by collusion. In this paper we first present a new secure signature scheme which is based on a variant of Strong Diffie-Hellman Assumption, called SDH2 assumption. Then, we extend this signature for a new multisignature scheme without interaction between users. Our proposed schemes which work in groups equipped with...
متن کاملA Structured Multisignature Scheme from the Gap Diffie-Hellman Group
In this paper, the authors propose a new structured multisignature scheme that considers the signing order among co-signers. The proposed scheme can resolve signing structures of serial, parallel, and the mix of them. Moreover, the size and the verification of a structured multisignature is the same as those of an individual signature generated by any co-signer. Arithmetically, the proposed sch...
متن کاملA Structured Aggregate Signature Scheme with Pairing-based Cryptography
In this study, we propose a new aggregate signature scheme with pairing-based cryptography that can describe the mixed/parallel structure of signers. Existing structured signature schemes are based on multisignature schemes, which are adapted for verification of a mixed/parallel structure if all signers sign the same document. However, if each signer wants to sign a document different from thos...
متن کاملMultisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
A multisignature scheme allows a group of signers to cooperate to generate a compact signature on a common document. The length of the multisignature depends only on the security parameters of the signature schemes and not on the number of signers involved. The existing state-of-the-art multisignature schemes suffer either from impractical key setup assumptions, from loose security reductions, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2002 شماره
صفحات -
تاریخ انتشار 2002